A Branch-and-Cut Algorithm for Design of MPLS Content Delivery Networks

Content Delivery Network (CDN) can be applied to improve effectiveness and robustness of Internet in an economical manner. In this work we present an optimization problem of replica server location of a CDN. Most of previous papers on CDNs focus on connectionless techniques. In this paper we assume that CDN is located in MPLS network and traffic is modeled as connection-oriented flow. Another novelty, comparing to previous works on this subject, is that network congestion is used as the objective function. Since the considered optimization problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut approach. We present results of simulations showing comparison of branch-and-cut and branch-and-bound methods.